Status deleteTheSame(LNode *L)
{
	LNode *p,*t;
	while(L -> next)
	{
		n = L -> next -> data;
		p = L -> next -> next;
		while(p -> data == n)
			p = p -> next;
		t = L -> next -> next;
		L -> next -> next = p;
		Free(t,p);
		return OK;
	}
}	

Status Free(LNode *t,LNode *p)
{
	LNode *old;
	while(t != p)
	{
		old = t;
		t = t -> next;
		free(old);
	}
}
